Computations of probabilistic output admissible set for uncertain constrained systems

This paper considers uncertain constrained systems, and develops two algorighms for computing a probabilistic output admissible (POA) set which is a set of initial states probabilistically assured to satisfy the constraint. The first algorithm is inspired by an existing randomized sequential technique. The second algorithm alleviates the computational effort based on heuristics. The present algorithms terminate in a finite number of iterations and provides a POA set. Additionally, we can obtain information on the size of the resulting set a posteriori. A numerical simulation demonstrates the applicability of the POA set to control system designs.